package main

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

//中序遍历二叉树
func GetInnerVerse(root *TreeNode) []int {

	var ret []int
	var f func(nd *TreeNode)
	f = func(nd *TreeNode) {
		if nd == nil {
			return
		}
		f(nd.Left)
		ret = append(ret, nd.Val)
		f(nd.Right)

	}
	f(root)
	return ret

}

func main() {

}
